Coverage-Based Dynamic Mutant Subsumption Graph
نویسندگان
چکیده
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولA DTD Graph Based XPath Query Subsumption Test
XPath expressions play a central role in querying for XML fragments. We present a containment test of two XPath queries which checks whether a new XPath query XP1 can reuse a previous query result XP2. The key idea is to transform XP1 into a graph which is used to search for sequences of elements which are used in the XPath query XP2.
متن کاملGraph Subsumption in Abstract State Space Exploration
ion is an essential ingredient in nearly all methods for system analysis and verification and as such there is a vast body of work describing the use of abstractions in different domains. In this section we give a (non-exhaustive) discussion on related work that involves state space traversal and graphs. In [11], Holte et al. tackle the area of problem solving in artificial intelligence, which ...
متن کاملMulti-Agent Coordination Using Dynamic Behavior-Based Subsumption
Team coordination of non-player characters can create a deeper sense of immersion in real-time games by allowing characters to work together to produce better tactics and strategy. Achieving multi-agent coordination can be a difficult problem, and can incur substantial computational costs. Our goal with this work is to produce a reactive method for coordinating game characters that will allow c...
متن کاملParaphrase Identification with Lexico-Syntactic Graph Subsumption
The paper presents a new approach to the problem of paraphrase identification. The new approach extends a previously proposed method for the task of textual entailment. The relationship between paraphrases and entailment is discussed to theoretically justify the new approach. The proposed approach is useful because it uses relatively few resources compared to similar systems yet it produces res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2018
ISSN: 2475-8841
DOI: 10.12783/dtcse/mmsta2017/19661